Upper Bounds for the Error in Some Interpolation and Extrapolation Designs

the search for the self in becketts theatre: waiting for godot and endgame

this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...

Upper Bounds for Covering Designs by SimulatedAnnealingKari

A t ? (v; m; k;) covering design is a pair (X; A), where X is a set of v elements (called points) and A is a multiset of k-subsets of X (called blocks), such that every m-subset of X intersects at least members of A in at least t points. It is required that v k t and v m t. Such a covering design gives an upper bound on C (v; m; k; t), the number of blocks in a minimal t ? (v; m; k;) covering d...

Error bounds for bivariate piecewise hermite interpolation

Error bounds for anisotropic RBF interpolation

We present error bounds for the interpolation with anisotropically transformed radial basis functions for both function and its partial derivatives. The bounds rely on a growth function and do not contain unknown constants. For polyharmonic basic functions in R we show that the anisotropic estimates predict a significant improvement of the approximation error if both the target function and the...

Error Bounds for Polynomial Spline Interpolation

New upper and lower bounds for the L2 and Vo norms of derivatives of the error in polynomial spline interpolation are derived. These results improve corresponding results of Ahlberg, Nilson, and Walsh, cf. [1], and Schultz and Varga, cf. [5].